Linear Temporal Logic LTL: Basis for Admissible Rules
نویسندگان
چکیده
منابع مشابه
Linear Temporal Logic LTL: Basis for Admissible Rules
The object of our study is the propositional linear temporal logic LTL with operations Until and Next. We deal with inference rules admissible in LTL. Earlier the decidability of LTL w.r.t. to admissibility was shown. That, in particular, allowed to suggest a recursive infinite basis for admissible rules. However, that result gives no information about the structure and properties of such basis...
متن کاملIntransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules
Our paper studies linear temporal (with UNTIL and NEXT) logic based at a conception of intransitive time. non-transitive time. In particular, we demonstrate how the notion of knowledge might be represented in such a framework (here we consider logical operation N and the operation until U (actually, the time overall) to be directed to past). The basic mathematical problems we study are the fund...
متن کاملAdmissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
متن کاملLinear Temporal Logic (LTL) Based Monitoring of Smart Manufacturing Systems
The vision of Smart Manufacturing Systems (SMS) includes collaborative robots that can adapt to a range of scenarios. This vision requires a classification of multiple system behaviors, or sequences of movement, that can achieve the same high-level tasks. Likewise, this vision presents unique challenges regarding the management of environmental variables in concert with discrete, logic-based pr...
متن کاملBases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no finite basis of admissible rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2010
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exq020